Pathfinding is a kind of problem widely used in daily life. It is widely used in\nnetwork games, map navigation and other fields. However, the traditional A*\nalgorithm has some shortcomings, such as heuristic function needs to be designed\naccording to different problems, path has many inflection points, and\nalgorithm stability is poor. B* algorithm also has the shortcoming of inaccurate\npathfinding. In order to solve the problems existing in A* and B* algorithms,\nobstacle avoidance regeneration mechanism, pre-exploration mechanism\nand equivalent waiting strategy are proposed. It adds a bidirectional parallel\nsearch mechanism to form an IBP-B* algorithm (Intelligent bi-directional\nparallel B* routing algorithm). The simulation results show that the speed of\nIBP-B* algorithm is 182% higher than that of A* algorithm and 366% higher\nthan that of BFS algorithm. Meanwhile, compared with B* algorithm, IBP-B*\nalgorithm improves the pathfinding accuracy of the algorithm.
Loading....